Extracting Microstructure in Binary Constraint Networks
نویسندگان
چکیده
We present algorithms that perform the extraction of partial assignments from binary Constraint Satisfaction Problems without introducing new constraints. They are based on a new perspective on domain values: we view a value not as a single, indivisible unit, but as a combination of value fragments. Applications include removing nogoods while maintaining constraint arity, learning nogoods in the constraint network, enforcing on neighborhood inverse consistency and removal of unsolvable sub-problems from the constraint network.
منابع مشابه
Different Classes of Graphs to Represent Microstructures for CSPs
The CSP formalism has shown, for many years, its interest for the representation of numerous kinds of problems, and also often provide effective resolution methods in practice. This formalism has also provided a useful framework for the knowledge representation as well as to implement efficient methods for reasoning about knowledge. The data of a CSP are usually expressed in terms of a constrai...
متن کاملMicrostructures for CSPs with Constraints of Arbitrary Arity
Many works have studied the properties of CSPs which are based on the structures of constraint networks, or based on the features of compatibility relations. Studies on structures rely generally on properties of graphs for binary CSPs and on properties of hypergraphs for the general case, that is CSPs with constraints of arbitrary arity. In the second case, using the dual representation of hype...
متن کاملTractable Classes of Binary CSPs Defined by Excluded Topological Minors
The binary Constraint Satisfaction Problem (CSP) is to decide whether there exists an assignment to a set of variables which satisfies specified constraints between pairs of variables. A CSP instance can be presented as a labelled graph (called the microstructure) encoding both the forms of the constraints and where they are imposed. We consider subproblems defined by restricting the allowed fo...
متن کاملTowards a Definition of the Constraint Probability of Non-Binary Constraint Networks
The constraint probability of a constraint network is the ratio of the number of constraints in the network over that of all possible constraints. While this parameter can be easily computed for binary networks, it is not clear how to compute it for non-binary networks. In a non-binary network, a constraint Cx of arity k induces constraints between any combination of the variables in the scope ...
متن کاملEnumeration of Dominant Solutions: An Application in Transport Network Design
A One-Dimensional Binary Integer Programming Problem (1DB-IPP) is concerned with selecting a subset from a set of k items in budget constraint to optimize an objective function. In this problem a dominant solution is defined as a feasible selection to which no further item could be added in budget constraint. This paper presents a simple algorithm for Enumeration of Dominant Solutions (EDS) and...
متن کامل